Weighted polynomial approximation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted Polynomial Approximation on the Integers

We prove here some polynomial approximation theorems, somewhat related to the Szasz-Mfintz theorem, but where the domain of approximation is the integers, by dualizing a gap theorem of C. l ~ Y I for periodic entire functions. In another Paper [7], we shall prove, by similar means, a completeness theorem ibr some special sets of entire functions. I t is well known (see, for example [l]) tha t i...

متن کامل

Weighted Polynomial Approximation in the Complex Plane

Given a pair (G,W ) of an open bounded set G in the complex plane and a weight function W (z) which is analytic and different from zero in G, we consider the problem of the locally uniform approximation of any function f(z), which is analytic in G, by weighted polynomials of the form {Wn(z)Pn(z)}n=0, where deg Pn ≤ n. The main result of this paper is a necessary and sufficient condition for suc...

متن کامل

A Survey of Weighted Polynomial Approximation with Exponential Weights

Let W : R → (0, 1] be continuous. Bernstein’s approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm f → ‖fW‖L∞(R). The qualitative form of this problem was solved by Achieser, Mergelyan, and Pollard, in the 1950’s. Quantitative forms of the problem were actively investigated starting from the 1960’s. We survey old and recent aspects of this t...

متن کامل

Polynomial time approximation of dense weighted instances of MAX-CUT

We give the rst polynomial time approximability characterization of dense weighted instances of MAX-CUT, and some other dense weighted NP-hard problems in terms of their empirical weight distributions. This gives also the rst almost sharp characterization of inapproximability of unweighted 0,1 MAX-BISECTION instances in terms of their density parameter only.

متن کامل

Weighted Polynomial Approximation for Automated Detection of Inspiratory Flow Limitation

Inspiratory flow limitation (IFL) is a critical symptom of sleep breathing disorders. A characteristic flattened flow-time curve indicates the presence of highest resistance flow limitation. This study involved investigating a real-time algorithm for detecting IFL during sleep. Three categories of inspiratory flow shape were collected from previous studies for use as a development set. Of these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1986

ISSN: 0021-9045

DOI: 10.1016/0021-9045(86)90089-4